Best Possible Triangle Inequalities for Statistical Metric Spaces1

نویسنده

  • EDWARD THORP
چکیده

1. A statistical metric space2 (briefly, an S M space) is a set 5 and a mapping $ from SXS into the set of distribution functions (i.e., real-valued functions of a real variable which are everywhere defined, nondecreasing, left-continuous and have inf 0 and sup 1). The distribution function *5(p, q) associated with a pair of points (p, q) in S is denoted by Fpq. The functions Fpq are assumed to satisfy: (SM-I) Fpq(x) = 1 for all x > 0 iff p = q. (SM-II) Fpq(0)=0. (SM-III) FPq = Fqp. (SM-IV) If Fpt(x) = 1 and Fqr(y) = 1, then Fpr(x+y) = 1. A real-valued function T, whose domain is the set of real number pairs (x, y) such that 0 5¡x, y SI, is called a t-function if it satisfies the following conditions: (T-I) T(a, l)=a, T(0, 0)=0. (T-II) T(c, d) ^ T(a, b) if c^a, d^b. (T-III) T(a,b) = T(b,a) (commutativity). (T-IV) T[T(a, b), c] = T[a, T(b, c)] (associativity). Definition 1. A Menger space (S, 5, T) is an SM space (S, ff) and a ¿-function T such that the triangle inequality, (SM-IVm) Fpr(x+y)^T(Fpq(x), Fqr(y)), holds for all points p, q, r in S and for all numbers x, y^O. Definition 2. The ¿-function Ti is stronger than the ¿-function T2, and we write Ti^T2, if 7"i(x, y) ^ T2(x, y) for O^x, yál¡ Ti is strictly stronger than T2 if Ti is stronger than T2 and there is at least one pair of numbers (x, y) such that 7\(x, y) > T2(x, y). Correspondingly, T2 is weaker or strictly weaker than Tu For a given SM space there is in general more than one ¿-function which makes it a Menger space. In particular, if (S, í, J") is a Menger space and U is weaker than T, then (S, ï, U) is also a Menger space

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triangle inequalities in path metric spaces

We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to R+ or to R , every triple of real numbers satisfying the strict triangle inequalities, is realized by the side-lengths of a triangle in X . We construct an example of a complete path metric space quasi-isometric to R2 for which every degenerate triangle has one side wh...

متن کامل

Triangle Fixing Algorithms for the Metric Nearness Problem

Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the properties of a metric, especially the triangle inequality. Applications where metric data is useful include clustering, classification, metric-based indexing, and approximation algorithms for various graph problems. This pap...

متن کامل

Approximation algorithms for the traveling salesman problem

We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called differential-approximation ratio, that measures how the value of an approximate solution is placed in the in...

متن کامل

On the metric triangle inequality

A non-contradictible axiomatic theory is constructed under the local reversibility of the metric triangle inequality. The obtained notion includes the metric spaces as particular cases and the generated metric topology is T$_{1}$-separated and generally, non-Hausdorff.

متن کامل

The Möbius-pompeïu Metric Property

Let us consider analogous problem for the metric space (X, d) with at least four points. Let A,B,C ∈ X be three fixed points. Then, for the point M ∈ X we suppose that a triangle can be formed from the distances d1 = d(M,A), d2 = d(M,B) and d3 = d(M,C) iff the following conjunction of inequalities is true: d1 + d2 − d3 ≥ 0 and d2 + d3 − d1 ≥ 0 and d3 + d1 − d2 ≥ 0. (1.1) If in conjunction (1.1)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010